A Recursive Information Gene Selection Using Improved Laplacian Maximum Margin Criterion ⋆
نویسندگان
چکیده
Gene selection is an important research topic in pattern recognition and tumor classification. Numerous methods have been proposed, Maximum Margin Criterion (MMC) is one of the famous methods have been proposed to solve the small size samples problem. But, the MMC only considers the global structure of samples. In this article, a novel recursive gene selection criterion named Laplacian Maximum Margin Criterion Recursive Feature Elimination (LMMC-RFE) is proposed to address this issue. The Laplacian within-class scatter matrix and Laplacian between-class scatter matrix can be formulated by the use of LoG weighted matrix to capture the scatter information. The neighboring structure of the withinclass samples is preserving while the samples from different classes are mapped far from each other. The successful application to the Colon dataset, Prostate dataset and Leukemia dataset suggests this proposed method is more efficient and competitive in gene selection.
منابع مشابه
Improving Chernoff criterion for classification by using the filled function
Linear discriminant analysis is a well-known matrix-based dimensionality reduction method. It is a supervised feature extraction method used in two-class classification problems. However, it is incapable of dealing with data in which classes have unequal covariance matrices. Taking this issue, the Chernoff distance is an appropriate criterion to measure distances between distributions. In the p...
متن کاملLaplacian Maximum Margin Criterion for Image Recognition
Previous works have demonstrated that Laplacian embedding can well preserve the local intrinsic structure. However, it ignores the diversity and may impair the local topology of data. In this paper, we build an objective function to learn the local intrinsic structure that characterizes both the local similarity and diversity of data, and then combine it with global structure to build a scatter...
متن کاملLaplacian Spectrum Learning
The eigenspectrum of a graph Laplacian encodes smoothness information over the graph. A natural approach to learning involves transforming the spectrum of a graph Laplacian to obtain a kernel. While manual exploration of the spectrum is conceivable, non-parametric learning methods that adjust the Laplacian’s spectrum promise better performance. For instance, adjusting the graph Laplacian using ...
متن کاملMulti-Focus Image Fusion in DCT Domain using Variance and Energy of Laplacian and Correlation Coefficient for Visual Sensor Networks
The purpose of multi-focus image fusion is gathering the essential information and the focused parts from the input multi-focus images into a single image. These multi-focus images are captured with different depths of focus of cameras. A lot of multi-focus image fusion techniques have been introduced using considering the focus measurement in the spatial domain. However, the multi-focus image ...
متن کاملImproving MSVM-RFE for Multiclass Gene Selection∗
Along with the advent of DNA microarray technology, gene expression profiling has been widely used to study molecular signatures of many diseases and to develop molecular diagnostics for disease prediction. In class prediction problems using expression data, gene selection is essential to improve the prediction accuracy and to identify informative genes for a disease. In this paper we improve t...
متن کامل